Polar Codes: Graph Representation and Duality
نویسندگان
چکیده
منابع مشابه
Strange duality and polar duality
We describe a relation between Arnold’s strange duality and a polar duality between the Newton polytopes which is mostly due to M. Kobayashi. We show that this relation continues to hold for the extension of Arnold’s strange duality found by C. T. C. Wall and the author. By a method of Ehlers-Varchenko, the characteristic polynomial of the monodromy of a hypersurface singularity can be computed...
متن کاملFlexible Length Polar Codes through Graph Based Augmentation
The structure of polar codes inherently requires block lengths to be powers of two. In this paper, we investigate how different block lengths can be realized by coupling of several short-length polar codes. For this, we first analyze “code augmentation” to better protect the semipolarized channels, improving the BER performance under belief propagation decoding. Several serial and parallel augm...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملPolarization and Polar Codes
This tutorial treats the fundamentals of polarization theory and polar coding. Arıkan’s original results on binary source and channel polarization methods are studied. Error probability and complexity analyses are offered. The original results are generalized in several directions. Early developments in the field are discussed, pointers to some of the important work omitted from this tutorial a...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2015
ISSN: 1089-7798
DOI: 10.1109/lcomm.2015.2455031